skip to main content


Search for: All records

Creators/Authors contains: "Chan, Garnet Kin-Lic"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract

    Recent experimental advances have stimulated interest in the use of large, two-dimensional arrays of Rydberg atoms as a platform for quantum information processing and to study exotic many-body quantum states. However, the native long-range interactions between the atoms complicate experimental analysis and precise theoretical understanding of these systems. Here we use new tensor network algorithms capable of including all long-range interactions to study the ground state phase diagram of Rydberg atoms in a geometrically unfrustrated square lattice array. We find a greatly altered phase diagram from earlier numerical and experimental studies, revealed by studying the phases on the bulk lattice and their analogs in experiment-sized finite arrays. We further describe a previously unknown region with a nematic phase stabilized by short-range entanglement and an order from disorder mechanism. Broadly our results yield a conceptual guide for future experiments, while our techniques provide a blueprint for converging numerical studies in other lattices.

     
    more » « less
  2. We have designed a [Fe(SH)4H]− model with the fifth proton binding either to Fe or S. We show that the energy difference between these two isomers (∆E) is hard to estimate with quantum-mechanical (QM) methods. For example, different density functional theory (DFT) methods give ∆E estimates that vary by almost 140 kJ/mol, mainly depending on the amount of exact Hartree–Fock included (0%–54%). The model is so small that it can be treated by many high-level QM methods, including coupled-cluster (CC) and multiconfigurational perturbation theory approaches. With extrapolated CC series (up to fully connected coupled-cluster calculations with singles, doubles, and triples) and semistochastic heat-bath configuration interaction methods, we obtain results that seem to be converged to full configuration interaction results within 5 kJ/mol. Our best result for ∆E is 101 kJ/mol. With this reference, we show that M06 and B3LYP-D3 give the best results among 35 DFT methods tested for this system. Brueckner doubles coupled cluster with perturbaitve triples seems to be the most accurate coupled-cluster approach with approximate triples. CCSD(T) with Kohn–Sham orbitals gives results within 4–11 kJ/mol of the extrapolated CC results, depending on the DFT method. Single-reference CC calculations seem to be reasonably accurate (giving an error of ∼5 kJ/mol compared to multireference methods), even if the D1 diagnostic is quite high (0.25) for one of the two isomers.

     
    more » « less
    Free, publicly-accessible full text available July 28, 2024
  3. Tensor contractions are ubiquitous in computational chemistry andphysics, where tensors generally represent states or operators andcontractions express the algebra of these quantities. In this context,the states and operators often preserve physical conservation laws,which are manifested as group symmetries in the tensors. These groupsymmetries imply that each tensor has block sparsity and can be storedin a reduced form. For nontrivial contractions, the memory footprint andcost are lowered, respectively, by a linear and a quadratic factor inthe number of symmetry sectors. State-of-the-art tensor contractionsoftware libraries exploit this opportunity by iterating over blocks orusing general block-sparse tensor representations. Both approachesentail overhead in performance and code complexity. With intuition aidedby tensor diagrams, we present a technique, irreducible representationalignment, which enables efficient handling of Abelian group symmetriesvia only dense tensors, by using contraction-specific reduced forms.This technique yields a general algorithm for arbitrary group symmetriccontractions, which we implement in Python and apply to a variety ofrepresentative contractions from quantum chemistry and tensor networkmethods. As a consequence of relying on only dense tensor contractions,we can easily make use of efficient batched matrix multiplication viaIntel’s MKL and distributed tensor contraction via the Cyclops library,achieving good efficiency and parallel scalability on up to 4096 KnightsLanding cores of a supercomputer.

     
    more » « less
  4. The quantitative description of correlated electron materials remains a modern computational challenge. We demonstrate a numerical strategy to simulate correlated materials at the fully ab initio level beyond the solution of effective low-energy models and apply it to gain a detailed microscopic understanding across a family of cuprate superconducting materials in their parent undoped states. We uncover microscopic trends in the electron correlations and reveal the link between the material composition and magnetic energy scales through a many-body picture of excitation processes involving the buffer layers. Our work illustrates a path toward a quantitative and reliable understanding of more complex states of correlated materials at the ab initio many-body level.

     
    more » « less
  5. Abstract

    Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.

     
    more » « less